Simultaneous Search in Connection Tableau Calculi by Means of Disjunctive Constraints
نویسنده
چکیده
Automated theorem proving with connection tableau calculi imposes search problems in tremendous search spaces. In this paper, we present a new approach to search space reduction in connection tableau calculi. In our approach structurally similar parts of the search space are compressed by means of disjunctive constraints. We describe the necessary changes of the calculus, and we develop elaborate techniques for an efficient constraint processing. Moreover, we present an experimental evaluation of our approach.
منابع مشابه
A Non-clausal Connection Calculus
A non-clausal connection calculus for classical first-order logic is presented that does not require the translation of input formulae into any clausal form. The definition of clauses is generalized, which may now also contain (sub-) matrices. Copying of appropriate (sub-)clauses in a dynamic way, i.e. during the actual proof search, is realized by a generalized extension rule. Thus, the calcul...
متن کاملWhat You Always Wanted to Know About Rigid E-Uni cation
This paper solves an open problem posed by a number of researchers: the construction of a complete calculus for matrix-based methods with rigid E-uniication. The use of rigid E-uniication and simultaneous rigid E-uniication for such methods has been proposed in (Gallier et al., 1987). After our proof of the undecidability of simultaneous rigid E-uniication (Degtyarev and Voronkov, 1996e) it has...
متن کاملUsing the TPTP Language for Representing Derivations in Tableau and Connection Calculi
The TPTP language, developed within the framework of the TPTP library, allows the representation of problems and solutions in first-order and higher-order logic. Whereas the writing of solutions in resolution calculi is well documented and used, an appropriate representation of solutions in tableau or connection calculi using the TPTP syntax has not yet been specified. This paper describes how ...
متن کاملA Theorem Prover for Equality using Lemmas
Equality handling has been traditionally one of the weaknesses of tableau-based theorem provers in general, from which those based on the Connection Tableau Calculus are not an exception. The Intermediate Lemma Extension is based on a simple extension to Logic Programming in which positive subgoals are skipped and all clauses treated as Horn clauses, allowing to derive clauses consisting of onl...
متن کاملReduction rules and universal variables for first order tableaux and DPLL
Recent experimental results have shown that the strength of resolution, the propositional DPLL procedure, the KSAT procedure for description logics, or related tableau-like implementations such as DLP, is due to reduction rules which propagate constraints and prune the search space. Yet, for first order logic such reduction rules are only known for resolution. The lack of reduction rules for fi...
متن کامل